Search results for "Discrete mathematics"
showing 10 items of 1728 documents
Two-dimensional Banach spaces with polynomial numerical index zero
2009
We study two-dimensional Banach spaces with polynomial numerical indices equal to zero.
Common fixed points of g-quasicontractions and related mappings in 0-complete partial metric spaces
2012
Abstract Common fixed point results are obtained in 0-complete partial metric spaces under various contractive conditions, including g-quasicontractions and mappings with a contractive iterate. In this way, several results obtained recently are generalized. Examples are provided when these results can be applied and neither corresponding metric results nor the results with the standard completeness assumption of the underlying partial metric space can. MSC:47H10, 54H25.
On two classes of finite supersoluble groups
2017
ABSTRACTLet ℨ be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ℨ-S-semipermutable if H permutes with every Sylow p-subgroup of G in ℨ for all p∉π(H); H is said to be ℨ-S-seminormal if it is normalized by every Sylow p-subgroup of G in ℨ for all p∉π(H). The main aim of this paper is to characterize the ℨ-MS-groups, or groups G in which the maximal subgroups of every Sylow subgroup in ℨ are ℨ-S-semipermutable in G and the ℨ-MSN-groups, or groups in which the maximal subgroups of every Sylow subgroup in ℨ are ℨ-S-seminormal in G.
A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…
2020
Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P
Existence of fixed point for GP(Λ;Θ)-contractive mappings in GP-metric spaces
2017
We combine some classes of functions with a notion of hybrid $GP_{(\Lambda,\Theta )}$ - $H$ - $F$ - contractive mapping for establishing some fixed point results in the setting of $GP$-metric spaces. An illustrative example supports the new theory.
ORBITALLY NONEXPANSIVE MAPPINGS
2015
We define a class of nonlinear mappings which is properly larger than the class of nonexpansive mappings. We also give a fixed point theorem for this new class of mappings.
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Statistics-preserving bijections between classical and cyclic permutations
2012
Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…
Variational Approximations for Generalized Linear Latent Variable Models
2017
Generalized linear latent variable models (GLLVMs) are a powerful class of models for understanding the relationships among multiple, correlated responses. Estimation, however, presents a major challenge, as the marginal likelihood does not possess a closed form for nonnormal responses. We propose a variational approximation (VA) method for estimating GLLVMs. For the common cases of binary, ordinal, and overdispersed count data, we derive fully closed-form approximations to the marginal log-likelihood function in each case. Compared to other methods such as the expectation-maximization algorithm, estimation using VA is fast and straightforward to implement. Predictions of the latent variabl…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.